Feasible Combinatorial Matrix Theory
نویسندگان
چکیده
We give the first, as far as we know, feasible proof of König’s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, and we show the equivalence of KMM to various Min-Max principles, with proofs of low complexity.
منابع مشابه
Feasible combinatorial matrix theory Polytime proofs for König’s Min-Max and related theorems
We show that the well-known König’s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory LA with induction restricted to Σ1 formulas. This is an improvement over the standard textbook proof of KMM which requires Π2 induction, and hence does not yield feasible proofs — while our new approach does. LA is a weak theory that essentially...
متن کاملEfficient SSD Integrity Verification Program Based on Combinatorial Group Theory
In digital forensics, the issue of data integrity protection for increasingly widespread applied SSD (Solid State Disk, SSD) is to be resolved. Based on Combinatorial Group Theory, mapping data objects in SSD validation process and test object in combination group testing methods, using the non-adaptive mode to the initial calculation, stored procedures, and re-calculate, verify process, and ca...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملMultiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algorithm for solving such a problem is proposed. The algorithm allows us to efficiently solve this NP-hard problem that has prohibitive computational complexity for classical combinatorial optimization methods. It also allo...
متن کامل